A SAT-Based Algorithm for Context Matching
نویسندگان
چکیده
The development of more and more complex distributed applications over large networks of computers has raised the problem of semantic interoperability across applications based on local and autonomous semantic schemas (e.g., concept hierarchies, taxonomies, ontologies). In this paper we propose to view each semantic schema as a context (in the sense defined in [1]), and propose an algorithm for automatically discovering relations across contexts (where relations are defined in the sense of [8]). The main feature of the algorithm is that the problem of finding relationships between contexts is encoded as a problem of logical satisfiability, and so the discovered mappings have a well–defined semantic. The algorithm we describe has been implemented as part of a peer-to-peer system for Distributed Knowledge Management, and tested on significant cases.
منابع مشابه
A New RSTB Invariant Image Template Matching Based on Log-Spectrum and Modified ICA
Template matching is a widely used technique in many of image processing and machine vision applications. In this paper we propose a new as well as a fast and reliable template matching algorithm which is invariant to Rotation, Scale, Translation and Brightness (RSTB) changes. For this purpose, we adopt the idea of ring projection transform (RPT) of image. In the proposed algorithm, two novel s...
متن کاملA Novel Technique for Steganography Method Based on Improved Genetic Algorithm Optimization in Spatial Domain
This paper devotes itself to the study of secret message delivery using cover image and introduces a novel steganographic technique based on genetic algorithm to find a near-optimum structure for the pair-wise least-significant-bit (LSB) matching scheme. A survey of the related literatures shows that the LSB matching method developed by Mielikainen, employs a binary function to reduce the numbe...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملMapping and Resynthesis for LUT-based FPGAs with an Efficient SAT-Based Boolean Matching
To support FPGA synthesis in the OAGear package, we have implemented the following new components: (i) a cut-based technology mapper for LUT-based FPGA with delay/area optimization options, (ii) an efficient SAT-based Boolean matcher (SAT-BM) for both single-output and multipleoutput Boolean functions, and (iii) an area-aware resynthesis algorithm using this SAT-BM. The SAT-BM incorporates the ...
متن کاملA SAT based algorithm for the matching problem in bigraphs with sharing
Bigraphical reactive systems are a formalism for modelling mobile computation. A bigraph consists of a place graph and a link graph; reaction rules define how place and link graphs evolve. Bigraphs originally supported only tree structures as place graphs, we have extended the formalism to bigraphs with sharing, which allow directed acyclic graphs as place graphs. A major challenge for bigraph ...
متن کاملAn Algorithm for Color Matching of Textiles With Elimination of Limitation on Primaries
The proposed algorithm suggests a new method for determination of K/S value of primaries based on linear least Squares Technique. By applying the matrix pseudoinverse, a modification is introduced to eliminate the limitation on the numbers of applied dyes in one – constant Kubelka-Munk theory. The selection of dyes for tristimulus matching are also done on the basis of the initial spectrophotom...
متن کامل